Prolog program transformations and tree manipulation algorithms
نویسندگان
چکیده
منابع مشابه
Prolog Program Development via Enhanced Schema-based Transformations
We describe state-of-the-practice results in integrating a program transformation approach to a program development environment. We propose a formalisation for a speciic kind of programming knowledge, the programming techniques. Our proposal employs program schemata, generic descriptions of programs addressing portions of predicate deenitions in an economical manner, allowing important features...
متن کاملAlgorithms + Data Structures + Transformations = Portable Program Performance
Many scientiic applications require sparse matrix computations. For example, Finite Element model-ing and N-body simulations. It is diicult to write these codes in a portable way which also achieves high performance because of the sparsity of the matrices and because current architectures have deep memory hierarchies and multiple levels of parallelism. Therefore the implementation of such compu...
متن کاملComposing Inference Algorithms as Program Transformations
Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-toprogram transformations. These transformations perform exact inference as well as g...
متن کاملProgram Veriication and Prolog
We show here that veriication of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of oundering. Finally, we discuss which aspects of these techniques can be automated. Notes.
متن کاملList manipulation in Turbo Prolog
The present paper is concerned with list processing in Turbo Prolog language. It doesn't claim to be an exhaustive description of operations which can be performed upon lists. Nevertheless adduced programs are most representative, more or less known to specialists in logic programming domain. By means of examples are explained the list manipulation techniques, use of recursion, declarative comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1985
ISSN: 0743-1066
DOI: 10.1016/0743-1066(85)90012-3